Conversion CSG-BRep de scènes définies par des quadriques. (Boundary evaluation of scenes defined by quadrics)
نویسنده
چکیده
The objective of this thesis is to investigate the problem of boundary evaluation, which transforms the CSG model of a scene to its BRep corresponding model, for scenes defined by quadrics. This algorithm consists of four steps : (i) the parameterization of every intersection curve between quadrics ; (ii) the calculation of the intersection points between such curves and the quadrics ; (iii) the determination, among the resulting arcs of curves, of those that limit a face of the BRep model ; (iv) the identification of the arcs that delimit a single face, and their assembling into chains of arcs ; some faces might contain « holes », and thus may be limited by several chains of arcs. The first two steps were solved using two algorithms from the litterature. The two remaining steps were solved by introducing new algorithms : VE (Visible Edges) and CA (Chains Assembling) respectively. Our algorithm of boundary evaluation is robust in the sense that all degenerate configurations are considered in the paradigm of exact geometric computing. It solves entirely the problem for scenes defined by quadrics. Its time-complexity is O(n) in the worst case, where n is the number of quadrics. A partial implementation was developed and preliminary experimental results were obtained.
منابع مشابه
Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils
While Part I [2] of this paper was devoted mainly to quadrics intersecting in a smooth quartic, we now focus on singular intersections. To produce optimal or near-optimal parameterizations in all cases, we first determine the the real type of the intersection before computing the actual parameterization. In this second part, we present the first classification of pencils of quadrics based on th...
متن کاملCounting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem
Given a set S of n points in three dimensions, we study the maximum numbers of quadrics spanned by subsets of points in S in various ways. We prove that the set of empty or enclosing ellipsoids has Θ(n) complexity. The same bound applies to empty general cylinders, while for empty circular cylinders a gap remains between the Ω(n) lower bound and the O(n) upper bound. We also take interest in pa...
متن کاملNear-Optimal Parameterization of the Intersection of Quadrics: IV. An Efficient and Exact Implementation
We present the first complete, robust, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It is based on the near-optimal algorithm presented in Parts I, II, and III [5, 6, 7] of this paper. Our implementation correctly identifies and parameterizes all the algebraic components of the intersection in all case...
متن کاملA Face Area Evaluation Algorithm for Solids in CSG Representation
This paper presents a scan curve algorithm for evaluating the face area of solids in constructive solid geometry (CSG) representation. Compared to previous methods, the algorithm is more accurate and computationally faster. The applicable domain is limited to solids bounded by three classes of surfaces: all quadric surfaces, cylindrical surfaces, and surfaces of revolution which are algebraic s...
متن کاملDeux approches pour la comparaison de relations spatiales floues. Transport optimal et morphologie mathématique
RÉSUMÉ. Les relations spatiales sont au cœur de beaucoup de méthodes d’interprétation de scènes à l’aide d’informations structurelles. Lorsque ces scènes sont analysées par comparaison avec un modèle, ou lorsqu’elles sont dynamiques et que l’on s’intéresse à leur évolution, il faut alors développer des outils pour comparer des relations spatiales, souvent exprimées ou connues de manière impréci...
متن کامل